Linearizability of planar polynomial Hamiltonian systems
نویسندگان
چکیده
Isochronicity and linearizability of two-dimensional polynomial Hamiltonian systems are revisited new results presented. We give a computational procedure to obtain the necessary sufficient conditions for linearization system. Using computer algebra we provide with homogeneous non-linearities degrees 5, 6 7. also present some nonhomogeneous nonlinearities two, three five.
منابع مشابه
Isochronicity and Linearizability of Planar Polynomial Hamiltonian Systems
In this paper we study isochronicity and linearizability of planar polynomial Hamiltonian systems. First we prove a theorem which supports a negative answer to the following open question: Do there exist planar polynomial Hamiltonian systems of even degree having an isochronous center? stated by Jarque and Villadelprat in the J. Differential Equations 180 (2002), 334–373. Additionally we obtain...
متن کاملNetworks of planar Hamiltonian systems
We introduce diffusively coupled networks where the dynamical system at each vertex is planar Hamiltonian. The problems we address are synchronisation and an analogue of diffusion-driven Turing instability for time-dependent homogeneous states. As a consequence of the underlying Hamiltonian structure there exist unusual behaviours compared with networks of coupled limit cycle oscillators or act...
متن کاملSymplectic maps for approximating polynomial Hamiltonian systems.
We study how to approximate polynomial Hamiltonian systems by composition of symplectic maps. Recently, a number of methods preserving the symplectic character have appeared. However, they are not completely satisfactory because, in general, they are computationally expensive, very difficult to obtain or their accuracy is relatively low. The efficiency of a numerical method depends on both its ...
متن کاملOn the M-polynomial of planar chemical graphs
Let $G$ be a graph and let $m_{i,j}(G)$, $i,jge 1$, be the number of edges $uv$ of $G$ such that ${d_v(G), d_u(G)} = {i,j}$. The $M$-polynomial of $G$ is $M(G;x,y) = sum_{ile j} m_{i,j}(G)x^iy^j$. With $M(G;x,y)$ in hands, numerous degree-based topological indices of $G$ can be routinely computed. In this note a formula for the $M$-polynomial of planar (chemical) graphs which have only vertices...
متن کاملDeciding Reachability for Planar Multi-polynomial Systems
In this paper we investigate the decidability of the reach-ability problem for planar non-linear hybrid systems. A planar hybrid system has the property that its state space corresponds to the standard Euclidean plane, which is partitioned into a nite number of (polyhedral) regions. To each of these regions is assigned some vector eld which governs the dynamical behaviour of the system within t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nonlinear Analysis-real World Applications
سال: 2022
ISSN: ['1878-5719', '1468-1218']
DOI: https://doi.org/10.1016/j.nonrwa.2021.103422